翻訳と辞書 Words near each other ・ Terlizzi railway station ・ Terloy ・ Terlton, Oklahoma ・ Term ・ Term (architecture) ・ Term (argumentation) ・ Term (logic) ・ Term (time) ・ Term algebra ・ Term and Quarter Days (Scotland) Act 1990 ・ Term Asset-Backed Securities Loan Facility ・ Term auction facility ・ Term Brady - EP ・ Term Catalogue ・ Term Discrimination ・ Term indexing ・ Term Life ・ Term life insurance ・ Term limit ・ Term Limits (novel) ・ Term limits in Oregon ・ Term limits in the United States ・ Term limits in Wyoming ・ Term loan ・ Term logic ・ Term of address ・ Term of endearment ・ Term of office ・ Term of patent ・ Term of patent in the United States Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Term indexing ： ウィキペディア英語版 Term indexing In computer science, a term index is a data structure to facilitate fast lookup of terms and clauses in a logic program, deductive database, or automated theorem prover. Many operations in automatic theorem provers require search in huge collections of terms and clauses. Such operations typically fall into the following scheme. Given a collection $S$ of terms (clauses) and a query term (clause) $q$, find in $S$ some/all terms $t$ related to $q$ according to a certain retrieval condition. Most interesting retrieval conditions are formulated as existence of a substitution that relates in a special way the query and the retrieved objects $t$. Here is a list of retrieval conditions frequently used in provers: * term $q$ is unifiable with term $t$, i.e., there exists a substitution $\backslash theta$, such that $q\backslash theta$ = $t\backslash theta$ * term $t$ is an instance of $q$, i.e., there exists a substitution $\backslash theta$, such that $q\backslash theta$ = $t$ * term $t$ is a generalisation of $q$, i.e., there exists a substitution $\backslash theta$, such that $q$ = $t\backslash theta$ * clause $q$ subsumes clause $t$, i.e., there exists a substitution $\backslash theta$, such that $q\backslash theta$ is a subset/submultiset of $t$ * clause $q$ is subsumed by $t$, i.e., there exists a substitution $\backslash theta$, such that $t\backslash theta$ is a subset/submultiset of $q$ More often than not, we are actually interested in finding the appropriate substitutions explicitly, together with the retrieved terms $t$, rather than just in establishing existence of such substitutions. Very often the sizes of term sets to be searched are large, the retrieval calls are frequent and the retrieval condition test is rather complex. In such situations linear search in $S$, when the retrieval condition is tested on every term from $S$, becomes prohibitively costly. To overcome this problem, special data structures, called ''indexes'', are designed in order to support fast retrieval. Such data structures, together with the accompanying algorithms for index maintenance and retrieval, are called ''term indexing techniques''. ==Classic indexing techniques== * discrimination trees * substitution trees * path indexing 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Term indexing」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.